Accurate Contention-aware Scheduling Method on Clustered Many-core Platform
نویسندگان
چکیده
منابع مشابه
Contention-Aware Scheduling with Task Duplication
Scheduling a task graph onto several processors is a trade-off between maximising concurrency and minimising interprocessor communication. A technique to reduce or avoid interprocessor communication is task duplication. Certain tasks are duplicated on several processors to produce the data locally and avoid the communication among processors. Most algorithms using task duplication are for the c...
متن کاملContention-Aware Lock Scheduling for Transactional Databases
Lock managers are among the most studied components in concurrency control and transactional systems. However, one question seems to have been generally overlooked: “When there are multiple lock requests on the same object, which one(s) should be granted first?” Nearly all existing systems rely on a FIFO (first in, first out) strategy to decide which transaction(s) to grant the lock to. In this...
متن کاملCAPS: Contention-Aware Proactive Scheduling for CMPs
Many Chip Multiprocessors (CMPs) rely on shared caches to hide the latency of inter-thread communications as well as to improve effective memory bandwidth. Yet along comes cache contention, which often results in cache thrashing and severe performance degradation. Because of the variety of programs, a suitable schedule can often alleviate the issues significantly. However, it remains an open qu...
متن کاملCo-scheduling on Upcoming Many-Core Architectures
Co-scheduling is known to optimize the utilization of supercomputers. By choosing applications with distict resource demands, the application throughput can be increased avoiding an underutilization of the available nodes. This is especially true for traditional multi-core architecture where a subset of the available cores are already able to saturate the main memory bandwidth. In this paper, w...
متن کاملLocality-Aware Many-Core Garbage Collection
The wide-scale deployment of multi-core and many-core processors will necessitate fundamental changes to garbage collectors. Highly parallel garbage collection is critical to the performance of these systems — today’s garbage collectors can quickly become the bottleneck for parallel programs. These processors will present additional new challenges — many contain non-uniform memory architectures...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Information Processing
سال: 2021
ISSN: 1882-6652
DOI: 10.2197/ipsjjip.29.216